Proof Nets for the Displacement Calculus
نویسنده
چکیده
The Displacement calculus was introduced by Morrill, Valent́ın & Fadda (2011) as an extension of the Lambek calculus with discontinuous operators. These discontinuous connectives allow the Displacement calculus to solve a large number of problems with the Lambek calculus. Examples of the phenomena treated by Morrill et al. (2011) include discontinuous idioms (such as “ring up” and “give the cold shoulder”), quantifier scope, extraction (including pied-piping) and gapping. This paper extends earlier work by Morrill & Fadda (2008), Moot (2014) and Valent́ın (2014), combining the strengths of these different approaches while at the same time diminishing the inconveniences. Notably, it is the first proof net calculus which does not operate by translation into some other logic, but provides proof nets for the Displacement calculus directly.
منابع مشابه
Multiplicative-Additive Focusing for Parsing as Deduction
Spurious ambiguity is the phenomenon whereby distinct derivations in grammar may assign the same structural reading, resulting in redundancy in the parse search space and inefficiency in parsing. Understanding the problem depends on identifying the essential mathematical structure of derivations. This is trivial in the case of context free grammar, where the parse structures are ordered trees; ...
متن کاملCanonical Proof nets for Classical Logic
Proof nets provide abstract counterparts to sequent proofs modulo rule permutations; the idea being that if two proofs have the same underlying proof-net, they are in essence the same proof. Providing a convincing proof-net counterpart to proofs in the classical sequent calculus is thus an important step in understanding classical sequent calculus proofs. By convincing, we mean that (a) there s...
متن کاملProof nets and the call-by-value λ-calculus
This paper gives a detailed account of the relationship between (a variant of) the call-by-value lambda calculus and linear logic proof nets. The presentation is carefully tuned in order to realize an isomorphism between the two systems: every single rewriting step on the calculus maps to a single step on proof nets, and viceversa. In this way, we obtain an algebraic reformulation of proof nets...
متن کاملProof nets and the call-by-value lambda-calculus
This paper gives a detailed account of the relationship between (a variant of) the call-by-value lambda calculus and linear logic proof nets. The presentation is carefully tuned in order to realize a strong bisimulation between the two systems: every single rewriting step on the calculus maps to a single step on the nets, and viceversa. In this way, we obtain an algebraic reformulation of proof...
متن کاملExpansion Nets: Proof-Nets for Propositional Classical Logic
We give a calculus of proof-nets for classical propositional logic. These nets improve on a proposal due to Robinson by validating the associativity and commutativity of contraction, and provide canonical representants for classical sequent proofs modulo natural equivalences. We present the relationship between sequent proofs and proof-nets as an annotated sequent calculus, deriving formulae de...
متن کامل